Extremal topological indices for graphs of given connectivity
نویسندگان
چکیده
منابع مشابه
Eccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملThe extremal values of some topological indices in bipartite graphs with a given matching number
Let I(G) be a topological index of a graph. If I(G+ e) < I(G) (or I(G+ e) > I(G), respectively) for each edge e ∈ G, then I(G) decreases (or increases, respectively) with addition of edges. In this paper, we determine the extremal values of some topological indices which decrease or increase with addition of edges, and characterize the corresponding extremal graphs in bipartite graphs with a gi...
متن کاملExtremal connectivity for topological cliques in bipartite graphs
Let d(s) be the smallest number such that every graph of average degree >d(s) contains a subdivision of Ks . So far, the best known asymptotic bounds for d(s) are (1+ o(1))9s2/64 d(s) (1+ o(1))s2/2. As observed by Łuczak, the lower bound is obtained by considering bipartite random graphs. Since with high probability the connectivity of these random graphs is about the same as their average degr...
متن کاملExtremal problems for degree-based topological indices
For a graph G, let σ(G) = ∑ uv∈E(G) 1 √ dG(u)+dG(v) ; this defines the sum-connectivity index σ(G). More generally, given a positive function t, the edge-weight t-index t(G) is given by t(G) = ∑ uv∈E(G) t(ω(uv)), where ω(uv) = dG(u) + dG(v). We consider extremal problems for the t-index over various families of graphs. The sum-connectivity index satisfies the conditions imposed on t in each ext...
متن کاملThe Topological Indices of some Dendrimer Graphs
In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2015
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1507639t